DYNAMIC BUILDING OF TRUE PARETO TUPLES IN PROBLEMS OF HYPER-VECTORIAL RANGING OF SYSTEMS

Safronov Valeriy Vasil'evich, doctor of technical scienсes, professor, senior research manager, Open joint stock company «KB Electropribor» (410065, 3 second Krasnoarmeiskytupic street, Saratov, Russia), svv@kbep.ru

519: 816

A new group of system analysis tasks is revealed, which proposes to fulfil the building of Pareto tuples in an initial stage and in «dynamic way» during the current stages. The mathematical definition of hypervector ranging problem is realized, which is reduced to the task of hypervector ranging. The possible situations during the systems reconfiguration are considered: the quantity and numbers of reconfiguring systems in an initial and current stages coincide; the quantity of reconfiguring systems in the current stages is not so many as it was taken into account in an initial stage, the new systems which should be reconfigured did not appear; the quantity of reconfiguring systems in the current stages is more, less or equal with the number of reconfiguring systems taken into account in an initial stage. There are systems taken into account in an initial stage, as well as newly appeared; the quantity of reconfiguring systems in the current stages is more, less or equal with the number of systems taken into account in an initial stage. All reconfiguring systems appeared in the current stages. The problem solution algorithm for each of the possible situations has been considered. It is based on the method of building the true Pareto tuples. This method could be used in the study of the technical, economical and social systems. The numerical example is given.

hypervector ranging, criteria, the true Pareto tuples.